Grünbaum colorings of toroidal triangulations
نویسندگان
چکیده
We prove that if G is a triangulation of the torus and χ(G) 6= 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors.
منابع مشابه
Color-induced subgraphs of Grünbaum colorings of triangulations of the sphere
A Grünbaum coloring of a triangulation is an assignment of colors to edges so that the edges about each face are assigned unique colors. In this paper we examine the color induced subgraphs given by a Grünbaum coloring of a triangulation and show that the existence of connected color induced subgraphs is equivalent to the Three Color Theorem. A triangulation of an orientable surface is an embed...
متن کاملSmall snarks and 6-chromatic triangulations on the Klein bottle
It is known that for every nonorientable surface there are infinitely many (large) snarks that can be polyhedrally embedded on that surface. We take a dual approach to the embedding of snarks on the Klein bottle, and investigate edge-colorings of 6-chromatic triangulations of the Klein bottle. In the process, we discover the smallest snarks that can be polyhedrally embedded on the Klein bottle....
متن کاملExtending Colorings of Locally
Suppose G is a graph embedded in S g with width (also known as edge width) at least 264(2 g ?1). If P V (G) is such that the distance between any two vertices in P is at least 16, then any 5-coloring of P extends to a 5-coloring of all of G. We present similar extension theorems for 6-and 7-chromatic toroidal graphs, for 3-colorable large-width graphs embedded on S g with every face even sided,...
متن کاملA bijection for essentially 4-connected toroidal triangulations
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications (drawing algorithm, random generation, enumeration. . . ). In this paper we introduce and study a generalization of these objects for the toroidal case. Contrary to...
متن کاملHamilton paths in toroidal graphs
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Williams independently conjectured that the same is true for toroidal graphs. In this paper, we prove that every 4-connected toroidal graph contains a Hamilton path. Partially supported by NSF grant DMS-9970514 Partially supported by NSF grants DMS-9970527 and DMS-0245530 Partially supported by RGC ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 63 شماره
صفحات -
تاریخ انتشار 2010